Belief Merging-Based Case Combination
Identifieur interne : 003992 ( Main/Exploration ); précédent : 003991; suivant : 003993Belief Merging-Based Case Combination
Auteurs : Julien Cojan [France] ; Jean Lieber [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
English descriptors
Abstract
Abstract: Integrity constraint belief merging aims at producing from several knowledge bases, that may be mutually inconsistent, a synthetic knowledge base satisfying a given integrity constraint. It is applied here to case combination for case-based reasoning. This approach is shown to extend Eyke Hüllermeier’s credible case-based inference and to be reducible under some assumptions to linear programming.
Url:
DOI: 10.1007/978-3-642-02998-1_9
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003B43
- to stream Istex, to step Curation: 003A99
- to stream Istex, to step Checkpoint: 000A99
- to stream Hal, to step Corpus: 001224
- to stream Hal, to step Curation: 001224
- to stream Hal, to step Checkpoint: 002B33
- to stream Main, to step Merge: 003A70
- to stream Main, to step Curation: 003992
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Belief Merging-Based Case Combination</title><author><name sortKey="Cojan, Julien" sort="Cojan, Julien" uniqKey="Cojan J" first="Julien" last="Cojan">Julien Cojan</name></author><author><name sortKey="Lieber, Jean" sort="Lieber, Jean" uniqKey="Lieber J" first="Jean" last="Lieber">Jean Lieber</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F7EFF350D2DF27127E739F9F7838F77F03645BBF</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-02998-1_9</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-QNTVXSB1-N/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003B43</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003B43</idno><idno type="wicri:Area/Istex/Curation">003A99</idno><idno type="wicri:Area/Istex/Checkpoint">000A99</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000A99</idno><idno type="wicri:doubleKey">0302-9743:2009:Cojan J:belief:merging:based</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00421724</idno><idno type="url">https://hal.inria.fr/inria-00421724</idno><idno type="wicri:Area/Hal/Corpus">001224</idno><idno type="wicri:Area/Hal/Curation">001224</idno><idno type="wicri:Area/Hal/Checkpoint">002B33</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002B33</idno><idno type="wicri:Area/Main/Merge">003A70</idno><idno type="wicri:Area/Main/Curation">003992</idno><idno type="wicri:Area/Main/Exploration">003992</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Belief Merging-Based Case Combination</title><author><name sortKey="Cojan, Julien" sort="Cojan, Julien" uniqKey="Cojan J" first="Julien" last="Cojan">Julien Cojan</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Lieber, Jean" sort="Lieber, Jean" uniqKey="Lieber J" first="Jean" last="Lieber">Jean Lieber</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Belief Merging</term><term>Case Combination</term><term>Credible Case-Based Inference</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Integrity constraint belief merging aims at producing from several knowledge bases, that may be mutually inconsistent, a synthetic knowledge base satisfying a given integrity constraint. It is applied here to case combination for case-based reasoning. This approach is shown to extend Eyke Hüllermeier’s credible case-based inference and to be reducible under some assumptions to linear programming.</div></front></TEI><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Cojan, Julien" sort="Cojan, Julien" uniqKey="Cojan J" first="Julien" last="Cojan">Julien Cojan</name></noRegion><name sortKey="Lieber, Jean" sort="Lieber, Jean" uniqKey="Lieber J" first="Jean" last="Lieber">Jean Lieber</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003992 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003992 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F7EFF350D2DF27127E739F9F7838F77F03645BBF
|texte= Belief Merging-Based Case Combination
}}
| This area was generated with Dilib version V0.6.33. |  |